A novel two-archive strategy for evolutionary many-objective optimization algorithm based on reference points
نویسندگان
چکیده
منابع مشابه
Two-Archive Evolutionary Algorithm for Constrained Multi-Objective Optimization
When solving constrained multi-objective optimization problems, an important issue is how to balance convergence, diversity and feasibility simultaneously. To address this issue, this paper proposes a parameter-free constraint handling technique, a two-archive evolutionary algorithm, for constrained multi-objective optimization. It maintains two co-evolving archives simultaneously: one, denoted...
متن کاملEvolutionary Many-Objective Optimization Based on Kuhn-Munkres' Algorithm
In this paper, we propose a new multi-objective evolutionary algorithm (MOEA), which transforms a multi-objective optimization problem into a linear assignment problem using a set of weight vectors uniformly scattered. Our approach adopts uniform design to obtain the set of weights and Kuhn-Munkres’ (Hungarian) algorithm to solve the assignment problem. Differential evolution is used as our sea...
متن کاملIGD Indicator-based Evolutionary Algorithm for Many-objective Optimization Problems
Inverted Generational Distance (IGD) has been widely considered as a reliable performance indicator to concurrently quantify the convergence and diversity of multiand manyobjective evolutionary algorithms. In this paper, an IGD indicatorbased evolutionary algorithm for solving many-objective optimization problems (MaOPs) has been proposed. Specifically, the IGD indicator is employed in each gen...
متن کاملA new uniform evolutionary algorithm based on decomposition and CDAS for many-objective optimization
The convergence and the diversity are two main goals of an evolutionary algorithm for many-objective optimization problems. However, achieving these two goals simultaneously is the difficult and challenging work for multi-objective evolutionary algorithms. A uniform evolutionary algorithm based on decomposition and the control of dominance area of solutions (CDAS) is proposed to achieve these t...
متن کاملGPGPU-Compatible Archive Based Stochastic Ranking Evolutionary Algorithm (G-ASREA) for Multi-Objective Optimization
In this paper, a GPGPU (general purpose graphics processing unit) compatible Archived based Stochastic Ranking Evolutionary Algorithm (G-ASREA) is proposed, that ranks the population with respect to an archive of non-dominated solutions. It reduces the complexity of the deterministic ranking operator from O(mn) to O(man) and further speeds up ranking on GPU. Experiments compare G-ASREA with a C...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Soft Computing
سال: 2019
ISSN: 1568-4946
DOI: 10.1016/j.asoc.2019.02.040